AN INAPPROXIMABILITY OF TRANSSHIPMENT PROBLEMS WITH PERMUTABLE TRANSIT VECTORS
نویسندگان
چکیده
منابع مشابه
An Inapproximability of Transshipment Problems with Permutable Transit Vectors
We investigate the hardness of approximating a transshipment problem with a permutable transit vector. We have already known that the transshipment problem of minimizing the total shipping cost is NP-hard. In this paper, we prove that even if the unit shipping cost associated with every arc is given as a positive integer, there is no polynomial time constant factor approximation algorithm for t...
متن کاملSolving Fully Interval Transshipment Problems
A new method namely, splitting method is proposed for finding an optimal solution to a transshipment problem in which all parameters are real intervals. With the help of a numerical example, the proposed method is illustrated. The splitting method is extended to fully fuzzy transshipment problems. Mathematical Subject Classification: 03E72
متن کاملInapproximability of Stable Marriage Problems
The stable marriage problem has received considerable attention both due to its practical applications as well as its mathematical structure. While the original problem has all participants rank all members of the opposite sex in a strict order of preference, two natural variations are to allow for incomplete preference lists and ties in the preferences. Both variations are polynomially solvabl...
متن کاملInapproximability of Combinatorial Optimization Problems
We survey results on the hardness of approximating combinatorial optimization problems.
متن کاملInapproximability of some art gallery problems
We prove that the three art gallery problems Vertex Guard, Edge Guard and Point Guard for simple polygons with holes cannot be approximated by any polynomial time algorithm with a ratio of 1? 28 ln n, for any > 0, unless N P T IM E(n O(log log n)). We obtain our results by extending and modifying the concepts of a construction introduced in Eide98].
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 2010
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.53.220